Verification of Complex Real-time Systems using Rewriting Logic
نویسندگان
چکیده
منابع مشابه
Verification of Complex Real-Time Systems using Rewriting Logic
This paper presents a method for model checking dense complex real-time systems. This approach is implemented at the meta level of the Rewriting Logic system Maude. The dense complex real-time system is specified using a syntax which has the semantics of timed automata and the property is specified with the temporal logic TLTL (Timed LTL). The well known timed automata model checkers Kronos and...
متن کاملSpecifying real-time systems in rewriting logic
This work investigates the suitability of rewriting logic as a semantic framework for modeling real time and hybrid systems We present a general method to specify and symbolically simulate such systems in rewriting logic and illustrate it with a well known benchmark We also show how a wide range of real time and hybrid system models can be naturally expressed and are uni ed within our approach ...
متن کاملSafety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملVerification of CRWL Programs with Rewriting Logic
We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-deterministic and partial functions. Our approach transforms functionallogic programs into Maude theories and then uses the Rewriting Logic logical framework to verify properties of the transformed programs. We propose an induc...
متن کاملThe Verification of Real Time Systems Using the TINA Tool
In this paper, we propose a method for building a Timed Transition Graph (TTG) that uses a single clock from the state class graph of a bounded time Petri Net (TPN). To build this TTG a special state class construction available in Tina is used. This structure can be used to calculate “quantitative” temporal properties for the worst case scenario. It is possible to check efficiently several pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2009
ISSN: 1330-1136,1846-3908
DOI: 10.2498/cit.1001272